binary digit stringの例文

例文

1. I usually think of formal languages as having to be over finite alphabets, so " any subset of N is a formal language " assumes treating each integer k as ( say ) a binary digit string, over the alphabet { 0, 1 }.